Best-first search is a form of tree search where there is a heuristic evaluation for each node. At each step, the best-first algorithm chooses the node with the best heuristic to follow down the tree, only backtracking when it gets to a leaf node, or in some other way reaches em impasse.
Used in Chap. 4: pages 48, 49, 50, 55
Also known as best first, best first